Persistence of the incompressible Euler equations in a Besov space B 1 , 1 d + 1 ( R d )
نویسندگان
چکیده
منابع مشابه
Persistence of the incompressible Euler equations in a Besov space B d + , ( R d )
are considered. Here u(x, t) = (u,u, . . . ,ud) is the Eulerian velocity of a fluid flow and (u,∇)uk =∑di= u∂iu , k = , , . . . ,d with ∂i ≡ ∂ ∂xi . The best local existence and uniqueness results known for the Euler equations () in Besov spaces are a series of theorems on the space B p, (Rd) with < p ≤ ∞ (see the introductions in [, ] for details and the references therein). The loc...
متن کامل(r, R+1)-factorizations of (d, D+1)-graphs
A (d, d + 1)-graph is a graph whose vertices all have degrees in the set {d, d + 1}. Such a graph is semiregular. An (r, r + 1)-factorization of a graph G is a decomposition of G into (r, r + 1)-factors. For d-regular simple graphs G we say for which x and r G must have an (r, r + 1)-factorization with exactly x (r, r + 1)-factors. We give similar results for (d, d + 1)-simple graphs and for (d...
متن کاملEquations of ( 1 ; d ) - polarized
In this paper, we study the equations of projectively embedded abelian surfaces with a polarization of type (1; d). Classical results say that given an ample line bundle L on an abelian surface A, the line bundle L n is very ample for n 3, and furthermore, in case n is even and n 4, the generators of the homogeneous ideal I A of the embedding of A via L n are all quadratic; a possible choice fo...
متن کاملA Higher Order B-Splines 1-D Finite Element Analysis of Lossy Dispersive Inhomogeneous Planar Layers
In this paper we propose an accurate and fast numerical method to obtain scattering fields from lossy dispersive inhomogeneous planar layers for both TE and TM polarizations. A new method is introduced to analyze lossy Inhomogeneous Planar Layers. In this method by applying spline based Galerkin’s method of moment to scalar wave equation and imposing boundary conditions we obtain reflection and...
متن کاملComputing minimal interpolants in $C^{1, 1}(\mathbb{R}^d)$
We consider the following interpolation problem. Suppose one is given a finite set E ⊂ R, a function f : E → R, and possibly the gradients of f at the points of E. We want to interpolate the given information with a function F ∈ C(R) with the minimum possible value of Lip(∇F ). We present practical, efficient algorithms for constructing an F such that Lip(∇F ) is minimal, or for less computatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Difference Equations
سال: 2013
ISSN: 1687-1847
DOI: 10.1186/1687-1847-2013-153